Facility location problem under users with two type criteria, min-max and max-min
نویسندگان
چکیده
منابع مشابه
Min-max-min Geometric Facility Location Problems
We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...
متن کاملMulti-Criteria TSP: Min and Max Combined
We present randomized approximation algorithms for multicriteria traveling salesman problems (TSP), where some objective functions should be minimized while others should be maximized. For the symmetric multi-criteria TSP (STSP), we present an algorithm that computes (2/3−ε, 4+ε) approximate Pareto curves. Here, the first parameter is the approximation ratio for the objectives that should be ma...
متن کاملA Hybrid Min-min Max-min Algorithm with Improved Performance
The high cost of supercomputers and the need for large-scale computational resources has led to the development of network of computational resources known as Grid. To better use tremendous capabilities of this large scale distributed system, effective and efficient scheduling algorithms are needed. Many such algorithms have been designed and implemented. We introduce a new scheduling algorithm...
متن کاملMin-max and min-max (relative) regret approaches to representatives selection problem
The following optimization problem is studied. There are several sets of integer positive numbers whose values are uncertain. The problem is to select one representative of each set such that the sum of the selected numbers is minimum. The uncertainty is modeled by discrete and interval scenarios, and the min–max and min–max (relative) regret approaches are used for making a selection decision....
متن کاملMin, Max, and Sum
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Japan Association for Management Systems
سال: 2015
ISSN: 1884-2089,2188-2460
DOI: 10.14790/ijams.7.11